منابع مشابه
Batched bin packing
We introduce and study the batched bin packing problem (BBPP), a bin packing problem in which items become available for packing incrementally, one batch at a time. A batched algorithm must pack a batch before the next batch becomes known. A batch may contain several items; the special case when each batch consists of merely one item is the well-studied on-line bin packing problem. We obtain lo...
متن کاملAn 8/3 Lower Bound for Online Dynamic Bin Packing
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart dynamically. The objective is to minimize the maximum number of bins used over all time. The main result is a lower bound of 8/3 ∼ 2.666 on the achievable competitive ratio, improving the best known 2.5 lower bound. T...
متن کاملMore on batched bin packing
Bin packing is the problem of partitioning a set of items into subsets of total sizes at most 1. In batched bin packing, items are presented in k batches, such that the items of a batch are presented as a set, to be packed before the next batch. In the disjunctive model, a algorithm must use separate bins for the different batches. We analyze the asymptotic and absolute approximation ratios for...
متن کاملA Tighter Lower Bound for 1-D Bin-Packing
For NP-complete problems, it may not be possible to find an optimal solution in polynomial time. However, efficient approximation algorithms for many NP-complete problems do exist. A good approach is to find tighter upper and lower bounds on the optimal solutions. As the gap between these two bounds approaches zero, optimality is reached. For minimization problems, any feasible solution serves ...
متن کاملA tight lower bound for optimal bin packing
In this paper, we present an eecient algorithm to compute a tighter lower bound for the one-dimensional bin packing problem. The time complexity of the algorithm is O(n log n). We have simulated the algorithm on randomly generated bin packing problems with item sizes drawn uniformly from (a; b], 0 a < b B. If our lower bound is used, on average, the error of BFD is less than 2%. For a + b B, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2016
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2016.04.007